Uryson Width and Volume

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Width-volume Inequality

We prove that a bounded open set U in R n has k-width less than C(n) Volume(U) k/n. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in R n. In particular, we estimate the smallest (n-1)-dilation of any degree 1 map between two n-dimensional rectangles. For any pair of rectangles, our estimate is accurate up to a dimensional constant C(n). We...

متن کامل

mean platelet volume and red cell distribution width as a diagnostic marker in acute appendicitis

background: acute appendicitis (aa) is one of the most common causes of emergent surgeries. many methods are used for its diagnosis. objectives: this study was conducted to investigate the diagnostic value of mpv and rdw in acute appendicitis. patients and methods: this study was a retrospective multi-center cross sectional planned study. the study included 260 patients operated for aa and 158 ...

متن کامل

Beam-width-dependent filtering properties of strong volume holographic gratings.

The finite dimension of the incident beam used to read out volume holographic gratings has interesting effects on their filtering properties. As the readout beam gets narrower, there is more deviation from the ideal response predicted for monochromatic plane waves. In this paper we experimentally explore beam-width-dependent phenomena such as wavelength selectivities, angular selectivities, and...

متن کامل

Approximating clique-width and branch-width

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph “clique-width”. Clique-width is a measure of the difficulty of decomposing a graph in a kind of tree-structure, and if a graph has clique-width at most k then the corresponding decomposition of the graph is called a “k-expression”. ...

متن کامل

Lipshitz Maps from Surfaces

We give a simple procedure to estimate the smallest Lipshitz constant of a degree 1 map from a Riemannian 2-sphere to the unit 2-sphere, up to a factor of 10. Using this procedure, we are able to prove several inequalities involving this Lipshitz constant. For instance, if the smallest Lipshitz constant is at least 1, then the Riemannian 2-sphere has Uryson 1-Width less than 12 and contains a c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geometric and Functional Analysis

سال: 2020

ISSN: 1016-443X,1420-8970

DOI: 10.1007/s00039-020-00533-5